A characterization and some properties of the Banzhaf-Coleman-Dubey-Shapley sensitivity index

نویسندگان

Rana Barua

Satya R. Chakravarty

Sonali Roy

Palash Sarkar

چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approximation method for Power Indices for Voting Games

The Shapley value and Banzhaf index are two well known indices for measuring the power a player has in a voting game. However, the problem of computing these indices is computationally hard. To overcome this problem, we analyze approximation methods for computing these indices. Although these methods have polynomial time complexity, finding an approximate Shapley value using them is easier than...

متن کامل

The Complexity of Power-Index Comparison

We study the complexity of the following problem: Given two weighted voting games G′ and G′′ that each contain a player p, in which of these games is p’s power index value higher? We study this problem with respect to both the Shapley-Shubik power index [SS54] and the Banzhaf power index [Ban65, DS79]. Our main result is that for both of these power indices the problem is complete for probabili...

متن کامل

Shapley-Shubik and Banzhaf Indices Revisited

We provide a new axiomatization of the Shapley-Shubik and the Banzhaf power indices in the domain of simple superadditive games by means of transparent axioms. Only anonymity is shared with the former characterizations in the literature. The rest of the axioms are substituted by more transparent ones in terms of power in collective decisionmaking procedures. In particular, a clear restatement a...

متن کامل

Spanning connectivity games

The Banzhaf index, Shapley-Shubik index and other voting power indices measure the importance of a player in a coalitional game. We consider a simple coalitional game called the spanning connectivity game (SCG) based on an undirected, unweighted multigraph, where edges are players. We examine the computational complexity of computing the voting power indices of edges in the SCG. It is shown tha...

متن کامل